Experiments in Simple One-Dimensional Lossy Image Compression Schemes
نویسندگان
چکیده
This paper examines some one-dimensional lossy image compression schemes. To perform one-dimensional compression, an image is scanned into a one-dimensional array which is then compressed. Three types of scanning are considered: raster scan, Hilbert scan, and binary scan. Hilbert and binary scan are found to outperform raster scan. The methods considered for compression are integer wavelet transforms, a piecewise approximation with triggers (PAT) procedure introduced by Walach and Karnin [6], and a modified PAT algorithm (MPAT). Wavelets outperform MPAT in compression, and MPAT in turn outperforms PAT; however, MPAT and PAT are computationally far simpler than wavelet transforms.
منابع مشابه
A two-dimensional approach for lossless EEG compression
In this paper, we study various lossless compression techniques for electroencephalograph (EEG) signals. We discuss a computationally simple pre-processing technique, where EEG signal is arranged in the form of a matrix (2-D) before compression. We discuss a two-stage coder to compress the EEG matrix, with a lossy coding layer (SPIHT) and residual coding layer (arithmetic coding). This coder is...
متن کاملA family of image watermarking schemes based on lossy compression
This paper describes a methodology for obtaining watermarking schemes using different compression algorithms in the mark embedding process. The compression methods enclose both spatial and transformed domains and both scalar and vector quantization. The result is a family of watermarking algorithms which are robust against different lossy image compression, filtering, cropping and row/column re...
متن کاملGfwx: Good, Fast Wavelet Codec Ict Tech Report Ict-tr-01-2016
Wavelet image compression is a popular paradigm for lossy and lossless image coding, and the wavelet transform, quantization, and entropy encoding steps are well studied. Efficient implementation is straightforward for the first two steps using e.g. lifting and uniform scalar deadzone quantization, but entropy encoding is typically carried out using complex context modeling and arithmetic codin...
متن کاملEnhancement of Error-Correction Coding of Spatial Watermarks in Gray Code
This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against signal distortion caused by lossy data compression such as the JPEG scheme by taking advantage of the properties of Gray code. Two error-correction coding (ECC) schemes are used here: One scheme, referred to as the vertical ECC (VECC), is to encode information bits in a pixel by error-corre...
متن کاملContext-Based Arithmetic Coding for the DCT: Achieving high compression rates with block transforms and simple context modeling
Recent image compression schemes have focused primarily on wavelet transforms, culminating in the JPEG-2000 standard. Block based DCT compression, on which the older JPEG standard is based, has been largely neglected because wavelet based coding methods appear to offer better image quality. This paper presents a simple compression algorithm that uses arithmetic coding on the bit-planes of the D...
متن کامل